The Lattice of Flats and its Underlying Flag Matroid Polytope
نویسنده
چکیده
Let M be a matroid and F the collection of all linear orderings of bases ofM. orflags of M. We define the flag matroid polytope A(F)We determine when two vertices of A(F) are adjacent, and provide a bijection between maximal chains in the lattice of flats of M and certain maximal faces of A(F).
منابع مشابه
Flag enumerations of matroid base polytopes
In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes. Also, we show how the cd-index of a polytope can be expressed when a polytope is split by a hyperplane, and apply these to the cd-index of a matroid base polytope of a rank 2 matroid.
متن کاملComputing the Tutte Polynomial of a Matroid from its Lattice of Cyclic Flats
We show how the Tutte polynomial of a matroid M can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of M is already determined by the abstract lattice of its cyclic flats together with their cardinalities and ranks. They furthermore generalize similiar statements for perfect matroid designs and near d...
متن کاملThe Lattice of Cyclic Flats of a Matroid
Matroid theory is a combinatorial abstraction of geometry, with flats playing the role of subspaces. Cyclic flats are special flats that contain key geometric information about a matroid. This talk presents a variety of recent results and open problems about the lattice of cyclic flats. In particular, we show that every finite lattice arises as the lattice of cyclic flats of a (fundamental tran...
متن کاملSome Properties of Cyclic Flats of an Infinite Matroid
We prove that when a pre-independence space satisfies some natural properties, then its cyclic flats form a bounded lattice under set inclusion. Additionally, we show that a bounded lattice is isomorphic to the lattice of cyclic flats of a pre-independence space. We also prove that the notion of cyclic width gives rise to dual-closed and minorclosed classes of B-matroids. Finally, we find a dif...
متن کاملOn Binary Matroid Minors and Applications to Data Storage over Small Fields
Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space. In this paper we address th...
متن کامل